#include <bits/stdc++.h>
#include <queue>
using namespace std;

#define int int64_t
#define endl "\n"

using PII = pair<int, int>;
using TII = tuple<int, int, int>;
template<class T> using V = vector<T>;
using i64 = long long;
using i128 = __int128;
using u64 = unsigned long long;

#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR2(i, a, b, c) for (int i = (int)(a); i <= (int)(b); i += c)
#define FORD(i, b, a) for (int i = (int)(a); i >= (int)(b); i--)
#define FORD2(i, b, a, c) for (int i = (int)(a); i >= (int)(b); i -= c)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define lowbit(x) ((x) & (-x))
#define RE return;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define sz(x) (int)(x).size()

void solve() {
    int n, m;
    cin >> n >> m;

    V<int> w(n + 1, 0);

    FOR(i, 1, n) cin >> w[i];

    struct E {
        int b, c;
        bool operator<(const E &t) const {
            if (c == t.c) return b < t.b;
            return c > t.c;
        }
    };

    V<E> val(m);

    FOR(i, 0, m - 1) {
        cin >> val[i].b >> val[i].c;
    }

    sort(ALL(val));

    priority_queue<int, V<int>, greater<int>> q, qq;

    FOR(i, 1, n) q.push(w[i]);

    FOR(i, 0, m - 1) {
        int t = val[i].b;
        while (sz(q) && q.top() <= val[i].c && t) {
            qq.push(val[i].c);
            q.pop();
            t--;
        }
    }

    while (sz(q)) {
        qq.push(q.top());
        q.pop();
    }

    int ans = 0;

    while (sz(qq)) {
        ans += qq.top();
        qq.pop();
    }

    cout << ans;
}

signed main() {
    int Task = 1;

    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    while (Task--) {
        solve();
    }

    return 0;
}